Automatic Termination
نویسنده
چکیده
We give an overview of applications of weighted finite automata to automatically prove termination of rewriting. Instances of this approach are: standard and arctic matrix interpretations, and the match bound technique. These methods have been developed in recent years, and they are being used by today’s leading automated termination prover
منابع مشابه
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and determining how to proceed. In this paper, we address the issue of building termination analysis engines that are both highly automatic and easy to use in an interactive setting. We consider the problem in the context o...
متن کاملGenetic Algorithms with Automatic Accelerated Termination
The standard versions of Evolutionary Algorithms (EAs) have two main drawbacks: unlearned termination criteria and slow convergence. Although several attempts have been made to modify the original versions of Evolutionary Algorithms (EAs), only very few of them have considered the issue of their termination criteria. In general, EAs are not learned with automatic termination criteria, and they ...
متن کاملAutomatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation of the program’s heap. We first describe how an abstract interpretation can be used to construct a finite number of relations which, if each is well-founded, implies termination. We then give an abstract interpretation based on separation logic formulæ which tracks the...
متن کاملTermination of Context-Sensitive Rewriting
Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for proving termination of context-sensitive rewriting. The rst one is a modi cation of the technique of interpretation in a well-founded order, the second one is implied by a transformation in which context-sensitive ...
متن کاملTermination of context-sensitive rewriting
Context-sensitive term rewriting is a kind of term rewriting in which reduction is not allowed inside some xed arguments of some function symbols. We introduce two new techniques for proving termination of context-sensitive rewriting. The rst one is a modi cation of the technique of interpretation in a well-founded order, the second one is implied by a transformation in which context-sensitive ...
متن کاملTermination of Narrowing: Automated Proofs and Modularity Properties
In 1936, Alan Turing proved that the halting problem, that is, deciding whether a program terminates, is an undecidable problem for most practical programming languages. Even so, termination is so relevant that a vast number of techniques for proving the termination of programs have been researched in the recent decades. Term rewriting systems provide an abstract theoretical framework ideally s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009